General convexity, general concavity, fixed points, geometry, and min-max points
نویسندگان
چکیده
منابع مشابه
Fixed Points of the Min-Transformation
In this paper, the stochastic fixed-point equation X d = inf i≥1: Ti>0 Xi/Ti is studied, where d = means equality in law, (Xn)n≥1 and T = (Ti)i≥1 denote independent sequences of non-negative random variables, and X1,X2, ... are independent copies of the random variable X. Under suitable conditions on the given weight sequence T , most notably that 1 < EN < ∞ for N = ∑ i≥1 1{Ti>0} and that T has...
متن کاملFixed Points and Generalized Vector Equilibra in General Topological Spaces
In this paper, we first generalize a fixed point theorem due to Tarafdar from topological vector spaces to general topological spaces without linear structure. By using our new fixed point theorem, some new existence theorems of solutions for generalized vector equilibrium problems and generalized implicit vector variational inequality problems are proved under noncompact settings of general to...
متن کاملDiagonal arguments and fixed points
A universal schema for diagonalization was popularized by N.S. Yanofsky (2003), based on a pioneering work of F.W. Lawvere (1969), in which the existence of a (diagonolized-out and contradictory) object implies the existence of a fixed-point for a certain function. It was shown that many self-referential paradoxes and diagonally proved theorems can fit in that schema. Here, we fi...
متن کاملGreatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes
We give polynomial time algorithms for quantitative (and qualitative) reachability analysis for Branching Markov Decision Processes (BMDPs). Specifically, given a BMDP, and given an initial population, where the objective of the controller is to maximize (or minimize) the probability of eventually reaching a population that contains an object of a desired (or undesired) type, we give algorithms...
متن کاملCycle times and Xed Points of Min-max Functions
The dynamic behaviour of discrete event systems with only maximum timing constraints (or, dually, only minimum timing constraints) can be studied by linear methods based on max-plus algebra, as discussed in the recent book \Synchronization and Linearity" by Bac-celli, Cohen, Quadrat and Olsder. Systems with both maximum and minimum constraints are non-linear from this perspective and only limit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematica Moravica
سال: 2008
ISSN: 1450-5932,2560-5542
DOI: 10.5937/matmor0801063t